Equivalence relations in the theory of repetitive consumption

Preference for food in the function of the time since last consumption and total preference in the function of eating frequency are equivalent mathematical representations of attitudes governing food consumption. The observed and postulated properties of these functions imply a formal correspondence between preference maximizing and variety seeking behavior.     

Reformulating zero-sum games with multiple goals

This paper investigates the two-person zero-sum multiple payoff game in which the objective is to minimize a player's total underachievement from a fixed set of goals. It is demonstrated that a previous formulation of this problem can be substantially simplified.     

Optimal ordering policies when anticipating parameter changes in EOQ systems

The classical Economic Order Quantity Model requires the parameters of the model to be constant. Some EOQ models allow a single parameter to change with time. We consider EOQ systems in which one or more of the cost or demand parameters will change at some time in the future. The system we examine has two distinct advantages over previous models. One obvious advantage is that a change in any of the costs is likely to affect the demand rate and we allow for this. The second advantage is that often, the times that prices will rise are fairly well known by announcement or previous experience. We present the optimal ordering policy for these inventory systems with anticipated changes and a simple method for computing the optimal policy. For cases where the changes are in the distant future we present a myopic policy that yields costs which are near-optimal. In cases where the changes will occur in the relatively near future the optimal policy is significantly better than the myopic policy.     

Optimal set partitioning,matchings and lagrangian duality

We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge-weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge-weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones.     

The queueing system MX/G/1 and its ramifications

This paper deals with the bulk arrival queueing system M^X/G/1 and its ramifications. In the system M^X/G/1, customers arrive in groups of size X (a random variable) by a Poisson process, the service times distribution is general, and there is a single server. Although some results for this queueing system have appeared in various books, no unified account of these, as is being presented here, appears to have been reported so far. The chief objectives of the paper are (i) to unify by an elegant procedure the relationships between the p.g.f.'s

     

Interval estimation of a global optimum for large combinatorial problems

Consider an “intractable” optimization problem for which no efficient solution technique exists. Given a systematic procedure for generating independent heuristic solutions, we seek to obtain interval estimates for the globally optimal solution using statistical inference. In previous work, accurate point estimates have been derived. Determining interval estimates, however, is a considerably more difficult task. In this paper, we develop straightforward procedures which compute confidence intervals efficiently in order to evaluate heuristic solutions and assess deviations from optimality. The strategy presented is applicable to a host of combinatorial optimization problems. The assumptions of our model, along with computational experience, are discussed.     

Explicit steady state solutions for a particular M(x)/M/1 queueing system

An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given.     

Flowshop sequencing problem with ordered processing time matrices: A general case

The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems.     

基于TSMD-SVM-HMM的机内测试智能降虚警方法

机内测试虚警问题是影响系统完好性和使用保障费用的重要因素。针对环境因素导致的虚警问题,设计了时间环境应力测量装置,应用支持向量机的小样本学习优点,建立虚警与环境因素的关联关系,应用隐马尔可夫模型的连续动态信号处理能力,描述系统长期工作历程中虚警的发生规律,提出了基于时间环境应力测量装置-支持向量机-隐马尔可夫模型的机内测试智能降虚警方法。最后,在某型直升机航向姿态系统上进行了应用与验证,试验结果表明:该方法有效识别出了机内测试的虚警。     

机电系统故障—时间应力的关联分析技术研究

时间应力测量装置技术是一种测量和存储各种应力数据以及对这些数据进行挖掘与分析的技术。简要介绍了时间应力的基本概念及其研究应用的发展历程。在此基础上,提出了基于故障模式、影响及应力分析(FMESA)的时间应力与机电系统故障的定性关联分析方法和基于多元logistic回归的定量关联分析方法。最后,以某型航空地平仪为对象进行了案例研究。案例分析结果表明,文中提出的时间应力与机电系统故障的关联分析方法能分析出影响系统性能的关键应力因素,为机电系统的故障诊断及故障预测提供基础。